A Facet Generation Procedure for Solving 0/1 Integer Programs
نویسندگان
چکیده
This paper presents the Facet Generation Procedure (FGP) for solving 0/1 integer programs. The FGP seeks to identify a hyperplane that represents a facet of an underlying polytope to cut off the fractional solution to the linear programming relaxation of the integer programming problem. A set of standard problems is used to provide insight into the computational characteristics of the procedure.
منابع مشابه
Cover and Pack Inequalities for (Mixed) Integer Programming
We review strong inequalities for fundamental knapsack relaxations of (mixed) integer programs. These relaxations are the 0–1 knapsack set, the mixed 0–1 knapsack set, the integer knapsack set, and the mixed integer knapsack set. Our aim is to give a common presentation of the inequalities based on covers and packs and highlight the connections among them. The focus of the paper is on recent re...
متن کاملComputing deep facet-defining disjunctive cuts for mixed-integer programming
The problem of separation is to find an affine hyperplane, or “cut”, that lies between the origin O and a given closed convex set Q in a Euclidean space. We focus on cuts which are deep for the Euclidean distance, and facet-defining. The existence of a unique deepest cut is shown and cases when it is decomposable as a combination of facet-defining cuts are characterized using the reverse polar ...
متن کاملSatisfiability-Based Algorithms for 0-1 Integer Programming
In this paper we describe two Propositional Satisfiability-based algorithms for solving 0-1 integer linear programs (ILP). The algorithms are specifically targeted at ILP instances that are highly constrained, i.e. instances for which the constraints are hard to satisfy. The two algorithms are based on recent algorithms for solving instances of Propositional Satisfiability (SAT) which are also ...
متن کاملA polyhedral study on chance constrained program with random right-hand side
The essential structure of the mixed–integer programming formulation for chance–constrained program (CCP) with stochastic right–hand side is the intersection of multiple mixing sets with a 0− 1 knapsack. To improve our computational capacity on CCP, an underlying substructure, the (single) mixing set with a 0 − 1 knapsack, has received substantial attentions recently. In this study, we first pr...
متن کاملOn facets of the three-index assignment polytope
Two new classes of facet-defining inequalities for the three-index assignrnent polytope are identified in this paper. According to the shapes of their support index sets, we call these facets bull facets and comb facets respectively. The bull facet has Chvatal rank 1, while the comb facet has Chvatal rank 2. For a comb facet-defining inequality, the right-hand-side coefficient is a positive int...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Operations Research
دوره 47 شماره
صفحات -
تاریخ انتشار 1999